A Computational Model for ADA and other concurrent languages
نویسندگان
چکیده
منابع مشابه
Model for Concurrent Logic Languages *
One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent -logic languages is essentially different from the classical paradigms of ecs and TCSP. We define indeed a compositional semantics based on linear sequences, whilst more complicated structures, like trees and failure sets, are needed to model compositionally CGS and TCSP. Moreover, we prov...
متن کاملA Proof System for Concurrent ADA Programs
Asubset of ADA is introduced, ADA-CF. to study the basicsynchronization and communication primitive of ADA, the rendezvous. Basing ourselves on the techniques introduced by Apt, Francez and de Roever for their CSP proof system, we develop a Hoare-style proof system for proving partial correctness properties which is sound and relatively complete. The proof system is then extended to deal with s...
متن کاملA fully abstract model for concurrent logic languages
One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent -logic languages is essentially different from the classical paradigms of ecs and TCSP. We define indeed a compositional semantics based on linear sequences, whilst more complicated structures, like trees and failure sets, are needed to model compositionally CGS and TCSP. Moreover, we prov...
متن کاملA Concurrent Model for Imperative Languages with Improved Atomicity
We propose a new concurrent model for imperative languages where concurrency occurs at a subprogram level. This model introduces a new block sequential statement of the form ♯(G1, . . . , Gn) where each Gi is a statement. This statement tells the machine to execute G1, . . . , Gn sequentially and atomically (i.e., without interleaving). It therefore enhances atomicity and predictability in conc...
متن کاملThe Buffered π-Calculus: A Model for Concurrent Languages
Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered π-calculus — a variant of the π-calculus where channel names are classified into buffered and unbuffered: communication along buffered channels is asynchronous, and remains synchronous along unbuffered channels. We show that the buffered π-calculu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1983
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v12i162.7436